Combining Predicate Abstraction with Fixpoint Approximations
نویسنده
چکیده
In this paper we consider combining two techniques that have been effective in analyzing infinite-state systems: predicate abstraction and fixpoint approximations. Using a carefully crafted model of Airport Ground Network Control, we show that when predicate abstraction in a CEGAR loop fails to verify temporal logic properties of an infinite-state transition system, a combination of predicate abstraction with fixpoint approximations may provide improved performance for both safety and liveness property verification.
منابع مشابه
Partial Predicate Abstraction and Counter-Example Guided Refinement
In this paper we present a counter-example guided abstraction and approximation refinement (CEGAAR) technique for {\em partial predicate abstraction}, which combines predicate abstraction and fixpoint approximations for model checking infinite-state systems. The proposed approach incrementally considers growing sets of predicates for abstraction refinement. The novelty of the approach stems fro...
متن کاملHeuristics for Selecting Predicates for Partial Predicate Abstraction
In this paper we consider the problem of configuring partial predicate abstraction that combines two techniques that have been effective in analyzing infinite-state systems: predicate abstraction and fixpoint approximations. A fundamental problem in partial predicate abstraction is deciding the variables to be abstracted and the predicates to be used. In this paper, we consider systems modeled ...
متن کاملDeriving Invariants by Algorithmic Learning, Decision Procedures, and Predicate Abstraction
By combining algorithmic learning, decision procedures, and predicate abstraction, we present an automated technique for finding loop invariants in propositional formulae. Given invariant approximations derived from preand post-conditions, our new technique exploits the flexibility in invariants by a simple randomized mechanism. The proposed technique is able to generate invariants for some Lin...
متن کاملModel Checking Recursive Programs with Exact Predicate Abstraction
We propose an approach for analyzing non-termination and reachability properties of recursive programs using a combination of overand underapproximating abstractions. First, we define a new concrete program semantics, mixed, that combines both natural and operational semantics, and use it to design an on-the-fly symbolic algorithm. Second, we combine this algorithm with abstraction by following...
متن کاملRefining Approximations in Software Predicate Abstraction
ion Thomas Ball†, Byron Cook†, Satyaki Das, and Sriram K. Rajamani† † Microsoft Corporation ? Stanford University Abstract. Predicate abstraction is an automatic technique that can be used to find abstract models of large or infinite-state systems. In tools like Slam, where predicate abstraction is applied to software model checking, a number of heuristic approximations must be used to improve ...
متن کامل